Dealing with Degeneracies in Automated Theorem Proving in Geometry

نویسندگان

چکیده

We report, through different examples, the current development in GeoGebra, a widespread Dynamic Geometry software, of geometric automated reasoning tools by means computational algebraic geometry algorithms. Then we introduce and analyze case degeneracy conditions that so often arise deduction context, proposing two ways for dealing with them. One is working saturation hypotheses ideal respect to ring geometrically independent variables, as way globally handle statement over all non-degenerate components. The second considering reformulation given ideal—considering variables invertible parameters—and developing exploiting specific properties this zero-dimensional individually truth

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Theorem Proving in Projective Geometry with Bracket Algebra

We present a method which can produce readable proofs for theorems of constructive type involving points, lines and conics in projective geometry. The method extends Wu’s method to bracket algebra and develops the area method of Chou, Gao and Zhang in the framework of projective geometry.

متن کامل

Automated theorem proving for elementary geometry

Thesis: Automated theorem proving for elementary geometry. This study analyses automated proofs of theorems from Euclidean Elements , book VI, using the area method. The theorems we will be discussing concern Euclidean field theory about equality of non-congruent figures and similarity of the figures [1]. The proofs are generated by the program WinGCLC. My proposed hypothesizes: 1. The way of m...

متن کامل

Combining Dynamic Geometry, Automated Geometry Theorem Proving and Diagrammatic Proofs

This paper outlines Geometry Explorer, a prototype system that allows users to create Euclidean geometry constructions using a dynamic geometry interface, specify conjectures about them and then use a full-angle method prover to automatically produce diagram independent, human-readable proofs to theorems. Our system can then automatically generate novel diagrammatic proofs of the forward-chaini...

متن کامل

Automated Theorem Proving in aSimple

Higher-order representation techniques allow elegant encod-ings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally incompatible with induction principles needed to reason about them. In this paper we develop a meta-logic M2 which allows inductive reasoning over LF encodings, and describe its implementation in Twelf, a special-purpose automa...

متن کامل

Automated Geometry Theorem Proving for Human-Readable Proofs

Geometry reasoning and proof form a major and challenging component in the K-121 mathematics curriculum. Although several computerized systems exist that help students learn and practice general geometry concepts, they do not target geometry proof problems, which are more advanced and difficult. Powerful geometry theorem provers also exist, however they typically employ advanced algebraic metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9161964